PSPACE-decidability of Japaridze's polymodal logic
نویسنده
چکیده
In this paper we prove that Japaridze’s Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames that can be applied to obtain upper complexity bounds for various modal logics.
منابع مشابه
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Or lowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forward inclusion and the backward inclusion relations. In 1987, Vakarelov provides the first first-order characterization of structures derived from information systems and this has been done with the semantical structu...
متن کاملThe product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of knowledge as well as temporal logics and polymodal K are discussed. All those products form rather...
متن کاملPolymodal faulting: Time for a new angle on shear failure
Conjugate, or bimodal, fault patterns dominate the geological literature on shear failure. Based on Anderson's (1905) application of the Mohr-Coulomb failure criterion, these patterns have been interpreted from all tectonic regimes, including normal, strike-slip and thrust (reverse) faulting. However, a fundamental limitation of the Mohr-Coulomb failure criterion e and others that assume faults...
متن کاملOn PSPACE-decidability in Transitive Modal Logics
In this paper we describe a new method, allowing us to prove PSPACE-decidability for transitive modal logics. We apply it to L1 and L2, modal logics of Minkowski spacetime. We also show how to extend this method to some other transitive logics.
متن کاملResiduated Basic Logic II. Interpolation, Decidability and Embedding
We prove that the sequent calculus LRBL for residuated basic logic RBL has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic BPL. Thus RBL is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that BPL is PSPACE-complete, and that intuitionistic logic can be embedded into...
متن کامل